Deterministic automaton - PDFSEARCH.IO - Document Search Engine

Deterministic automaton
Results: 176

#	Item
131	A General Weighted Grammar Library Cyril Allauzen, Mehryar Mohri, and Brian Roark AT&T Labs – Research, Shannon Laboratory 180 Park Avenue, Florham Park, NJ[removed] {allauzen, mohri, roark}@research.att.com http://w Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2009-11-02 10:14:30 Models of computation Computer science Software engineering Finite state transducer Finite-state machine Nondeterministic finite automaton Deterministic finite automaton Context-free grammar Powerset construction Automata theory Formal languages Theoretical computer science
132	COMS W3261: Computer Science Theory Class time: Tuesdays and Thursdays 2:40 - 3:55 PM Class location: MUDD 833 Instructor: Allison Lewko Office hours for Instructor: Tuesdays 10:00 AM - 12:00 PM in CSB 519 Add to Reading List Source URL: www.cs.columbia.edu Language: English - Date: 2014-02-27 18:24:23 Formal languages Applied mathematics Mathematics Theory of computation Computability Deterministic finite automaton Nondeterministic finite automaton Finite-state machine Complexity class Automata theory Models of computation Theoretical computer science
133	Symposium on Theoretical Aspects of Computer Science[removed]Bordeaux), pp[removed]www.stacs-conf.org EFFICIENT MINIMIZATION OF DFAS WITH PARTIAL TRANSITION FUNCTIONS ANTTI VALMARI Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2008-02-05 08:15:37 DFA minimization Nondeterministic finite automaton Symbol Mathematics Computing Logic Büchi automaton Automata theory Models of computation Deterministic finite automaton
134	Deciding equivalence using type checking Colin Stirling [removed] LFCS School of Informatics University of Edinburgh Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2014-06-30 04:38:21 Model checking Finite-state machine Automata theory Models of computation Deterministic pushdown automaton
135	Lecture notes on automata, languages, and grammars Cristopher Moore January 11, 2013 Abstract These lecture notes are intended as a supplement to Moore and Mertens’ The Nature of Computation, and are available to anyon Add to Reading List Source URL: tuvalu.santafe.edu Language: English - Date: 2013-01-11 13:28:25 Applied mathematics Nondeterministic finite automaton Myhill–Nerode theorem DFA minimization Regular language Deterministic finite automaton Regular expression Finite-state machine Powerset construction Automata theory Theoretical computer science Computer science
136	series-parallel-loop construction (3.5, 3.6) ≥ NFA ⊃ Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2004-11-18 06:12:15 Applied mathematics Nondeterministic finite automaton Deterministic finite automaton Powerset construction Regular expression Regular language Automata theory Theoretical computer science Computer science
137	jn[removed]Finite state machines (fsm, sequential machines): examples and applications Goal of this chapter: fsm’s are everywhere in our technical world! Learn how to work with them. 2.1 Example: Design a finite Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2004-11-18 06:12:13 Finite-state machine Nondeterministic finite automaton Deterministic finite automaton Applied mathematics Function Counter Automata theory Models of computation Mathematics
138	jn[removed]Finite automata with external storage Concepts of this chapter: Finite automata with external storage of unbounded capacity, subject to various access restrictions that limit the automa’s power of compu Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2004-11-18 06:12:14 Theoretical computer science Deterministic pushdown automaton Nondeterministic finite automaton Finite-state machine Turing machine Linear bounded automaton Alphabet Queue automaton Counter automaton Automata theory Theory of computation Models of computation
139	Theory of computation: Summary of main concepts 5. Context-free languages, grammars and pushdown automata fsm Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-11-28 16:45:10 Models of computation Computer science Context-free language Deterministic pushdown automaton Pushdown automaton Context-free grammar Theory of computation SC CYK algorithm Formal languages Theoretical computer science Automata theory
140	libalf: the Automata Learning Framework⋆ (Extended Abstract) Benedikt Bollig1 , Joost-Pieter Katoen2 , Carsten Kern2 , Martin Leucker3, Daniel Neider2 , and David R. Piegdon2 1 Add to Reading List Source URL: libalf.informatik.rwth-aachen.de Language: English - Date: 2009-10-20 05:06:15 Theoretical computer science Models of computation Computer science Cybernetics Finite-state machine Learning automata Algorithm Computational learning theory Deterministic finite automaton Machine learning Automata theory Applied mathematics

UPDATE